Detailed Structure for Freiman ’ s 3 k − 3 Theorem
نویسنده
چکیده
Let A be a set of k integers. We study Freiman’s inverse problem with small doublings and continue the work of G. A. Freiman, I. Bardaji and D. J. Grynkiewicz by characterizing the detailed structure of A in Theorem 2.2 below when the sumset A + A contains exactly 3k−3 integers. Besides some familiar structures, such a set A can have a configuration composed of “additively minimal triangles.”
منابع مشابه
A 9 INTEGERS 15 A ( 2015 ) DETAILED STRUCTURE FOR FREIMAN ’ S 3 k � 3 THEOREM
Let A be a set of k integers. We study Freiman’s inverse problem with small doublings and continue the work of G. A. Freiman, I. Bardaji and D. J. Grynkiewicz by characterizing the detailed structure of A in Theorem 2.2 below when the sumset A+A contains exactly 3k 3 integers. Besides some familiar structures, such a set A can have a configuration composed of “additively minimal triangles.”
متن کاملAn Introduction to Additive Combinatorics
This is a slightly expanded write-up of my three lectures at the Additive Combinatorics school. In the first lecture we introduce some of the basic material in Additive Combinatorics, and in the next two lectures we prove two of the key background results, the Freiman-Ruzsa theorem and Roth’s theorem for 3-term arithmetic progressions. Lecture I: Introductory material 1. Basic Definitions. 2. I...
متن کاملLong arithmetic progressions in sets with small sumsets
This paper continues the series of papers on Inverse Additive Number Theory published in 1955–1964 (see references [84]–[92], [98] in [2]). Throughout the paper, we work with the set A ⊂ Z of cardinality |A| = k ≥ 3. We assume that A = {a0 = 0 < a1 < · · · < ak−1} and that the greatest common divisor of the numbers from A is 1. Let T denote the cardinality of the set 2A = A + A of all pairwise ...
متن کاملSets with Small Sumset and Rectification
We study the extent to which sets A ⊆ Z/NZ, N prime, resemble sets of integers from the additive point of view (“up to Freiman isomorphism”). We give a direct proof of a result of Freiman, namely that if |A+A| 6 K|A| and |A| < c(K)N then A is Freiman isomorphic to a set of integers. Because we avoid appealing to Freiman’s structure theorem, we get a reasonable bound: we can take c(K) > (32K) 2 ...
متن کاملCompressions, Convex Geometry and the Freiman-bilu Theorem
We note a link between combinatorial results of Bollobás and Leader concerning sumsets in the grid, the Brunn-Minkowski theorem and a result of Freiman and Bilu concerning the structure of sets A ⊆ Z with small doubling. Our main result is the following. If ε > 0 and if A is a finite nonempty subset of a torsion-free abelian group with |A + A| 6 K|A|, then A may be covered by e O(1) progression...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015